Extremum seeking for dynamic maps using Lie brackets and singular perturbations
نویسندگان
چکیده
We introduce a framework for the analysis of extremum seeking systems for dynamic maps based on Lie bracket approximations and singular perturbation theory. Using the introduced framework, we provide an extremum seeking regulator for a unicycle and prove its stability properties. © 2017 Elsevier Ltd. All rights reserved.
منابع مشابه
Extremum seeking on submanifolds in the Euclidian space
Extremum seeking is a powerful control method to steer a dynamical system to an extremum of a partially unknown function. In this paper, we introduce extremum seeking systems on submanifolds in the Euclidian space. Using a trajectory approximation technique based on Lie brackets, we prove that uniform asymptotic stability of the so-called Lie bracket system on themanifold implies practical unif...
متن کاملLie bracket approximation of extremum seeking systems
Extremum seeking feedback is a powerful method to steer a dynamical system to an extremum of a partially or completely unknown map. It often requires advanced system-theoretic tools to understand the qualitative behavior of extremum seeking systems. In this paper, a novel interpretation of extremum seeking is introduced.We show that the trajectories of an extremum seeking system can be approxim...
متن کاملExtremum seeking for limit cycle minimization
In many physical problems, equilibrium stabilization is not possible and the controlled system is in a limit cycle. If the size of the limit cycle depends on some of the control parameters, then a reasonable objective would be to tune this parameter to minimize the size of the limit cycle. In this paper, we propose a method for achieving this. This method is an extension of our earlier result [...
متن کاملDiscrete-time Stochastic Extremum Seeking
We present discrete-time stochastic extremum seeking algorithms and prove their convergence using stochastic averaging theory that we recently developed. First, we provide a discrete stochastic extremum seeking algorithm for a static map, in which measurement noise is considered and an ergodic discrete-time stochastic process is used as the excitation signal. Second, for discrete-time nonlinear...
متن کاملStochastic Nash Equilibrium Seeking for Games with General Nonlinear Payoffs
We introduce a multi-input stochastic extremum seeking algorithm to solve the problem of seeking Nash equilibria for a noncooperative game whose N players seek to maximize their individual payoff functions. The payoff functions are general (not necessarily quadratic), and their forms are not known to the players. Our algorithm is a nonmodel-based approach for asymptotic attainment of the Nash e...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Automatica
دوره 83 شماره
صفحات -
تاریخ انتشار 2017